Implementation in mixed Nash equilibrium

نویسندگان

  • Claudio Mezzetti
  • Ludovic Renou
چکیده

A mechanism implements a social choice correspondence f in mixed Nash equilibrium if, at any preference profile, the set of all (pure and mixed) Nash equilibrium outcomes coincides with the set of f -optimal alternatives for all cardinal representations of the preference profile. Unlike Maskin’s definition, our definition does not require each optimal alternative to be the outcome of a pure equilibrium. We show that set-monotonicity, a weakening of Maskin’s monotonicity, is necessary for mixed Nash implementation. With at least three players, set-monotonicity and no-veto power are sufficient. Important correspondences that are not Maskin monotonic can be implemented in mixed Nash equilibrium. © 2012 Elsevier Inc. All rights reserved. JEL classification: C72; D71

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Mixed-Nash Implementation∗

This note considers (complete information) Nash-implementation when mixed strategies are properly accounted for and the outcome space is infinite. We first construct an example in which preferences over lotteries fail the Archemedian axiom and show that, even under the classical sufficient conditions for implementation, the canonical mechanism for implementation fails: there exists a mixed-Nash...

متن کامل

Coupled coincidence point in ordered cone metric spaces with examples in game theory

In this paper, we prove some coupled coincidence point theorems for mappings with the mixed monotone property and obtain the uniqueness of this coincidence point. Then we providing useful examples in Nash equilibrium.

متن کامل

A game theory approach to the sawnwood and pulpwood markets in the north of Iran

Duopoly game theory is applied to the wood industrial markets (sawnwood and pulpwood markets) in the North of Iran. The Nash equilibrium and the dynamic properties of the system based on marginal adjustments are determined. The probability that the Nash equilibrium will be reached is almost zero. The dynamical properties of sawnwood and pulpwood prices derived via the duopoly game model are fou...

متن کامل

CMSC 858 F : Algorithmic Game Theory Fall 2010 Complexity of finding Nash equilibrium : PPAD completeness results

Nash’s theorem guarantees the presence of mixed nash equilibrium in every finite game. We are concerned here with the problem of finding such an equilibrium efficiently. In other words, does there exist an algorithm to find the mixed nash equilibrium in polynomial time? The answer to this question is not known but it is known finding mixed Nash equilibrium is PPAD complete, which implies some s...

متن کامل

The Structure and Complexity of Extreme Nash Equilibria ?

We study extreme Nash equilibria in the context of a selfish routing game. Specifically, we assume a collection of n users, each employing a mixed strategy, which is a probability distribution over m parallel identical links, to control the routing of its own assigned traffic. In a Nash equilibrium, each user selfishly routes its traffic on those links that minimize its expected latency cost. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 147  شماره 

صفحات  -

تاریخ انتشار 2012